Covering a Graph by Forests and a Matching
نویسندگان
چکیده
منابع مشابه
Covering a Graph by Forests and a Matching
We prove that for any positive integer k and for ε = 1/((k + 2)(3k2 + 1)), the edges of any graph whose fractional arboricity is at most k + ε can be decomposed into k forests and a matching.
متن کاملa genre analytic study of research papers written by bilingual writers and their beliefs: a case of persian-english writers
تحقیق حاضر گزارشی است از تحلیل بخش مقدمه دو دسته از مقالات که عبارتند از: 11 مقاله از دو نویسنده دوزبانه فارسی زبان, که شامل مقدمه 4 مقاله به زبان انگلیسی و چاپ شده در مجلات بین المللی, مقدمه 3 مقاله به زبان انگلیسی و 4 مقاله به زبان فارسی چاپ شده در مجلات داخلی می شود؛ و 12 مقاله از محققان خارجی که در مجله applied linguistics به چاپ رسیده است. مبنای تئوری این تحلیل ها نظریه سوئلز (1990) یا هما...
15 صفحه اولCovering matrices of a graph
Given a Graph G = ((V(G),E(G)), and a subset ) (G V S , S with a given property(covering set, Dominating set, Neighbourhood set), we define a matrix taking a row for each of the minimal set corresponding to the given property and a column for each of the vertex of G. The elements of the matrix are 1 or 0 respectively as the vertex is contained in minimal set or otherwise. That is matrix (mij)...
متن کاملCovering a graph with a constrained forest
Given an undirected graph on n vertices with weights on its edges, Min WCF(p) consists of computing a covering forest of minimum weight such that each of its tree components contains at least p vertices. It has been proved that Min WCF(p) is NP -hard for any p ≥ 4 (Imielinska et al., 1993) but (2 − 1 n )-approximable (Goemans and Williamson, 1995). While Min WCF(2) is polynomial-time solvable, ...
متن کاملCovering vertices of a graph by k disjoint cycles
Let d; k and n be three integers with k¿ 3; d¿ 4k − 1 and n¿ 3k. We show that if d(x) + d(y)¿d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d; n} vertices of G. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2011
ISSN: 0895-4801,1095-7146
DOI: 10.1137/100818340